On the number of triangles in 3-connected matroids

نویسنده

  • Manoel Lemos
چکیده

An element e of a 3-connected matroid M is said to be contractible provided that M/e is 3-connected. In this paper, we show that a 3-connected matroid M with exactly k contractible elements has at least max { r(M) + 6− 2k 4 , |E(M)| + 6− 3k 5 } triangles. For each k, we construct an infinite family of matroids that attain this bound. New sharp bounds for the number of triads of a minimally 3-connected matroid are obtained as a consequence of our main result. c © 2005 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Tensor Product of Graphs, Girth and Triangles

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

متن کامل

Wild triangles in 3-connected matroids

Let {a, b, c} be a triangle in a 3-connected matroid M . In this paper, we describe the structure of M relative to {a, b, c} when, for all t in {a, b, c}, either M\t is not 3-connected, or M\t has a 3-separation that is not equivalent to one induced by M .

متن کامل

Fork-decompositions of Matroids

One of the central problems in matroid theory is Rota’s conjecture that, for all prime powers q, the class of GF (q)–representable matroids has a finite set of excluded minors. This conjecture has been settled for q ≤ 4 but remains open otherwise. Further progress towards this conjecture has been hindered by the fact that, for all q > 5, there are 3–connected GF (q)–representable matroids havin...

متن کامل

On Totally Free Expansions of Matroids

The aim of this paper is to give insight into the behaviour of inequivalent representations of 3{connected matroids. An element x of a matroid M is xed if there is no extension M 0 of M by an element x 0 such that fx;x 0 g is independent and M 0 is unaltered by swapping the labels on x and x 0. When x is xed, a representation of M nx extends in at most one way to a representation of M. A 3{conn...

متن کامل

Fork-decompositions of ?\iatroids

One of the central problems in matroid theory is Rota's conjecture that, for all prime powers q, the class of GF(q)-representable matroids has a finite set of excluded minors. This conjecture has been settled for q s; 4 but remains open otherwise. Further progress towards this conjecture has been hindered by the fact that, for all q > 5, there are 3-connected GF(q)-representable matroids having...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2007